例句與造句

1. The TERMGRAPH conference focuses entirely on research into term graph rewriting and its applications.
2. They play a special role in the graph rewriting rules describing admissible changes of the graph.
3. They are encoded in graph rewrite / graph transformation rules and executed by graph rewrite systems / graph transformation tools.
4. They are encoded in graph rewrite / graph transformation rules and executed by graph rewrite systems / graph transformation tools.
5. Subgraph matching is also a substep in graph rewriting ( the most runtime-intensive ), and thus offered by graph rewrite tools.
6. It's difficult to find graph rewriting in a sentence. 用graph rewriting造句挺難的
7. Subgraph matching is also a substep in graph rewriting ( the most runtime-intensive ), and thus offered by graph rewrite tools.
8. Hypergraph, typed graph and attributed graph rewriting, for example, can be handled because they can be cast as adhesive HLR systems.
9. Term graphs are a prominent topic in programming language research since term graph rewriting rules are capable of formally expressing a compiler's operational semantics.
10. In mathematics, an "'adhesive category "'is a quivers, and the theory of adhesive categories is important in the theory of graph rewriting.
11. There is also another algebraic-like approach to graph rewriting, based mainly on Boolean algebra and an algebra of matrices, called "'matrix graph grammars " '.
12. Double pushout graph rewriting allows the specification of graph transformations by specifying a pattern of fixed size and composition to be found and replaced, where part of the pattern can be preserved.
13. In contrast a graph rewriting rule of the SPO approach is a single morphism in the category of labeled multigraphs and " partial mappings " that preserve the multigraph structure : r \ colon L \ rightarrow R.
14. A graph rewrite rule is applied to the host graph by searching for an occurrence of the pattern graph ( pattern matching, thus solving the subgraph isomorphism problem ) and by replacing the found occurrence by an instance of the replacement graph.
15. Formally, a graph rewriting system usually consists of a set of graph rewrite rules of the form L \ rightarrow R, with L being called pattern graph ( or left-hand side ) and R being called replacement graph ( or right-hand side of the rule ).
16. Formally, a graph rewriting system usually consists of a set of graph rewrite rules of the form L \ rightarrow R, with L being called pattern graph ( or left-hand side ) and R being called replacement graph ( or right-hand side of the rule ).
更多例句：  下一頁